Support Vector Machines for Segmental Minimum Bayes Risk Decoding

نویسنده

  • Veera Venkataramani
چکیده

Segmental Minimum Bayes Risk (SMBR) Decoding is an approach whereby we use a decoding criterion that is closely matched to the evaluation criterion (Word Error Rate) for speech recognition. This involves the refinement of the search space into manageable confusion sets (ie, smaller sets of confusable words). We propose using Support Vector Machines (SVMs) as a discriminative model in the refined search space. The hope is we will be able to use SVMs effectively when the search problem is broken down into sequence of independent and simpler problems. Our first approach will be to use SVMs to make hard decisions, ie, the SVMs will output a word for each confusion set. We will then show that on using a simple voting scheme we improve upon the baseline significantly (10% relative at 9%WER) on a small vocabulary task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Support Vector Machines for Segmental Minimum Bayes Risk Decoding of Continuous Speech

Segmental Minimum Bayes Risk (SMBR) Decoding involves the refinement of the search space into sequences of small sets of confusable words. We describe the application of Support Vector Machines (SVMs) as discriminative models for the refined search spaces. We show that SVMs, which in their basic formulation are binary classifiers of fixed dimensional observations, can be used for continuous spe...

متن کامل

Ginisupport vector machines for segmental minimum Bayes risk decoding of continuous speech

We describe the use of Support Vector Machines (SVMs) for continuous speech recognition by incorporating them in Segmental Minimum Bayes Risk decoding. Lattice cutting is used to convert the Automatic Speech Recognition search space into sequences of smaller recognition problems. SVMs are then trained as discriminative models over each of these problems and used in a rescoring framework. We pos...

متن کامل

Risk based lattice cutting for segmental minimum Bayes-risk decoding

Minimum Bayes Risk (MBR) decoders improve upon MAP decoders by directly optimizing loss function of interest: Word Error Rate MBR decoding is expensive when the search spaces are large Segmental MBR (SMBR) decoding breaks the single utterance-level MBR decoder into a sequence of simpler search problems. – To do this, the N-best lists or lattices need to be segmented We present: A new lattice se...

متن کامل

Risk Based Lattice Cut Segmental Minimum Bayes-r

Minimum Bayes-Risk (MBR) speech recognizers have been shown to give improvements over the conventional maximum a-posteriori probability (MAP) decoders through N-best list rescoring and A search over word lattices. Segmental MBR (SMBR) decoders simplify the implementation of MBR recognizers by segmenting the N-best lists or lattices over which the recognition is performed. We present a lattice c...

متن کامل

Discriminative training for segmental minimum Bayes risk decoding

A modeling approach is presented that incorporates discriminative training procedures within segmental Minimum Bayes-Risk decoding (SMBR). SMBR is used to segment lattices produced by a general automatic speech recognition (ASR) system into sequences of separate decision problems involving small sets of confusable words. Acoustic models specialized to discriminate between the competing words in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003